Data independent recursion in deductive databases

Integrity and Recursion: Two Key Issues for Deductive Databases

The notion of a deductive database has become rather popular during the last decade as a generic name for numerous approaches aiming at an extension of databases with rules. A kind of smallest common denominator of all these approaches is the exploitation of certain forms of general laws for an intensional representation of data. Assume, for example, that a general dependency like "Every employ...

Temporal Deductive Databases: Data Manipulation and Consistency

The notion of deductive database is generalized by extending the rst-order language, used to formulate facts, rules and constraints, to a rst-order language involving time operators. A deductive database based on such an extended language is called temporal. In this paper, we rst introduce two additional time operators, one to reference past tenses, the other to reference future tenses. Then, t...

Data mining in deductive databases using query flocks

Data mining can be defined as a process for finding trends and patterns in large data. An important technique for extracting useful information, such as regularities, from usually historical data, is called as association rule mining. Most research on data mining is concentrated on traditional relational data model. On the other hand, the query flocks technique, which extends the concept of ass...

CRD: A New Data Mining Method in Deductive Databases

Data Mining in Deductive Databases Using Query Flocks: Extended Abstract

Data mining can be defined as a process for finding trends and patterns in large data. An important technique for extracting useful information, such as regularities, from usually historical data, is called as association rule mining. Most research on data mining is concentrated on traditional relational data model. On the other hand, the query flocks technique, which extends the concept of ass...